A new clock synchronization algorithm for collaborative computing
نویسندگان
چکیده
This paper describes the analysis, implementation and performance of a new clock synchronization algorithm, which utilizes the physical properties of synthetic quartz crystals. Thus a very high accuracy (down to a few milliseconds) can be achieved. This algorithm adjusts itself to the preferences of the local quartz oscillator and dynamically to the changing environment conditions such as temperature, and humidity via a additional phase locked loop control loop. As the computing and bandwidth requirements could be kept pretty low, this algorithm could be very well used in mobile environment.
منابع مشابه
Lower bounds in distributed computing
Distributed computing is the study of achieving cooperative behavior between independent computing processes with possibly conflicting goals. Distributed computing is ubiquitous in the Internet, wireless networks, multi-core and multi-processor computers, teams of mobile robots, etc. In this thesis, we study two fundamental distributed computing problems, clock synchronization and mutual exclus...
متن کاملOptimal Deterministic Remote Clock Estimation in Real-Time Systems
In an OPODIS’06 paper, we laid down the foundations of a real-time distributed computing model (RT-Model) with non-zero duration computing steps, which reconciles correctness proofs and realtime schedulability analysis of distributed algorithms. By applying the RT-Model to the well-known drift-free internal clock synchronization problem, we proved that classic zero step-time analysis sometimes ...
متن کاملClock Synchronization using Packet Streams⋆
Recent distributed applications in the domains of digital audio and sensor networks require clock synchronization in the order of 10μs. The achievable precision depends on system properties like synchronization message delay and synchronization message pattern. These properties are often unknown or difficult to determine. Therefore we propose a new analysis for clock synchronization algorithms....
متن کاملBenchmark for Verification of Fault-Tolerant Clock Synchronization Algorithms
In this paper, we propose a benchmark for verification of properties of fault-tolerant clock synchronization algorithms, namely, a benchmark of a TTEthernet network, where properties of the clock synchronization algorithm as implemented in a TTEthernet network can be verified, and optimization techniques for verification purposes can be applied. Our benchmark, which assumes non-faulty component...
متن کاملA Model for Distributed Computing in Real - Time Systems
This work introduces a fault-tolerant real-time distributed computing model for messagepassing systems, which reconciles the distributed computing and the real-time systems perspective: By just replacing instantaneous computing steps with computing steps of non-zero duration, we obtain a model that both facilitates real-time schedulability analysis and retains compatibility with classic distrib...
متن کامل